Solving Closest Vector Instances Using an Approximate Shortest Independent Vectors Oracle
نویسندگان
چکیده
منابع مشابه
Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle
We give a polynomial time Turing reduction from the γ √ napproximate closest vector problem on a lattice of dimension n to a γapproximate oracle for the shortest vector problem. This is an improvement over a reduction by Kannan, which achieved γn 3
متن کاملSolving shortest and closest vector problems: The decomposition approach
In this paper, we present a heuristic algorithm for solving exact, as well as approximate, SVP and CVP for lattices. This algorithm is based on a new approach which is very different from and complementary to the sieving technique. This new approach frees us from the kissing number bound and allows us to solve SVP and CVP in lattices of dimension n in time 2 using memory 2. The key idea is to n...
متن کاملSampling Methods for Shortest Vectors, Closest Vectors and Successive Minima
In this paper we introduce a new lattice problem, the subspace avoiding problem (Sap). We describe a probabilistic single exponential time algorithm for Sap for arbitrary `p norms. We also describe polynomial time reductions for four classical problems from the geometry of numbers, the shortest vector problem (Svp), the closest vector problem (Cvp), the successive minima problem (Smp), and the ...
متن کاملFinding closest lattice vectors using approximate Voronoi cells
The two classical hard problems underlying the security of lattice-based cryptography are the shortest vector problem (SVP) and the closest vector problem (CVP). For SVP, lattice sieving currently has the best (heuristic) asymptotic time complexity: in high dimensions d, sieving can solve SVP in time 2, using 2 memory [Becker– Ducas–Gama–Laarhoven, SODA’16]. The best heuristic time complexity t...
متن کاملAll-Pairs Approximate Shortest Paths and Distance Oracle Preprocessing
Given an undirected, unweighted graph G on n nodes, there is an O(n2poly logn)-time algorithm that computes a data structure called distance oracle of size O(n5/3poly logn) answering approximate distance queries in constant time. For nodes at distance d the distance estimate is between d and 2d+ 1. This new distance oracle improves upon the oracles of Pǎtraşcu and Roditty (FOCS 2010), Abraham a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science and Technology
سال: 2015
ISSN: 1000-9000,1860-4749
DOI: 10.1007/s11390-015-1604-4